BASIC PRINCIPLES FOR CONSTRUCTING MIXING FUNCTIONS BASED ON THE SIMPLEST LINEAR AND NONLINEAR MAPPINGS

This article is dedicated to exploring the possibility of using simplest principles nonlinear discrete dynamic systems theory in computer cryptography, which are characterized by their chaotic behavior. The main problem calculations that number possible states a finite. Therefore, models chaos only an approximation true behavior, and each trajectory approximated system periodic. From mathematical point view, encryption information involves transforming space finite messages, similar phase dynamical systems. mixing function specifies such encryption. requirements for absence collisions, i.e., bijectivity mapping, good diffusion properties, and, addition, inverse transformation should not be more complicated than direct one. demonstrates it utilize properties spaces with Tent. To enhance superposition Tent map linear permutation (in general case Hill map) was used. advantages constructed functions simplicity implementation, speed problems, strong cryptographic persistence. Correlation analysis, sensitivity analysis lengths cycle periods divide into non-overlapping subsets have been conducted these functions. As result, expected confirmed. applying image demonstrated.